Polynomial time computations in models of ET
نویسندگان
چکیده
منابع مشابه
Semantics vs Syntax vs Computations: Machine Models for Type-2 Polynomial-Time Bounded Functionals
This paper investigates analogs of the Kreisel-Lacombe-Shoenfield Theorem in the context of the type-2 basic feasible functionals. We develop a direct, polynomial-time analog of effective operation in which the time boundingon computations is modeled after Kapron and Cook’s scheme for their basic polynomial-time functionals. We show that if P = NP, these polynomial-time effective operations are...
متن کاملFast Matrix Polynomial Computations
Pour une matrice polynomiale P(x) de degr e d dans Mn;n(Kx]), o u K est un corps commutatif, une r eduction a la forme normale d'Hermite peut ^ etre calcul ee en O ~ (M(nd)) op erations arithm etiques, si M(n) est le co^ ut du produit de deux matrices n n sur K. De plus, une telle r eduction peut ^ etre obtenue en temps parall ele O(log +1 (nd)) en utilisant O(L(nd)) processeurs, si le probl em...
متن کاملNon-commutative Polynomial Computations
In [6] Mora described an algorithm which, if it terminates, returns a noncommutative Gröbner basis. Here we follow that paper to prove the correctness of the algorithm as implemented by Dié Gijsbers and the author in GAP, cf. [1]. The algorithm is the core algorithm of the GAP package GBNP for computing with non-commutative polynomials. Earlier versions of this section were written with the hel...
متن کاملA Local Criterion for Polynomial-Time Stratified Computations
Abstract. This work is a consequence of studying the (un)relatedness of the principles that allow to implicitly characterize the polynomial time functions (PTIME) under two perspectives. One perspective is predicative recursion, where we take Safe Recursion on Notation as representative. The other perspective is structural proof theory, whose representative can be Light Affine Logic (LAL). A wa...
متن کاملPolynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length: The General Purpose Analog Computer and Computable Analysis Are Two Efficiently Equivalent Models of Computations
The outcomes of this paper are twofold. Implicit complexity. We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class P of languages computable in polynomial time in terms of differential equations with polynomial right-hand side. This result gives a purely continuous (time and space) elegant and simple charact...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1983
ISSN: 0022-0000
DOI: 10.1016/0022-0000(83)90004-1